RIACS Technical Report 01.05

نویسندگان

  • Flavio Lerda
  • Willem Visser
چکیده

Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of their state and the dynamic nature of many programs. Here we address both these issues within the context of the Java PathFinder (JPF) model checker. Firstly, we will show how the state of a Java program can be encoded e ciently and how this encoding can be exploited to improve model checking. Next we show how to use symmetry reductions to alleviate some of the problems introduced by the dynamic nature of Java programs. Lastly, we show how distributed model checking of a dynamic program can be achieved, and furthermore, how dynamic partitions of the state space can improve model checking. We support all our ndings with results from applying these techniques within the JPF model checker.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Nas Parallel Benchmarks

A new set of benchmarks has been developed for the performance evaluation of highly parallel supercomputers. These benchmarks consist of five parallel kernels and three simulated application benchmarks. Together they mimic the computation and data movement characteristics of large scale computational fluid dynamics (CFD) applications. The principal distinguishing feature of these benchmarks is ...

متن کامل

Rule-Based Runtime Verification

We present a rule-based framework for defining and implementing finite trace monitoring logics, including future and past time temporal logic, extended regular expressions, real-time logics, interval logics, forms of quantified temporal logics, and so on. Our logic, EAGLE, is implemented as a Java library and involves novel techniques for rule definition, manipulation and execution. Monitoring ...

متن کامل

Non-Linear Filtering and Limiting in High Order Methods for Ideal and Non-Ideal MHD

The adaptive nonlinear filtering and limiting in spatially high order schemes (Yee et al. J. Comput. Phys. 150, 199–238, (1999), Sjögreen and Yee, J. Scient. Comput. 20, 211–255, (2004)) for the compressible Euler and Navier–Stokes equations have been recently extended to the ideal and non-ideal magnetohydrodynamics (MHD) equations, (Sjögreen and Yee, (2003), Proceedings of the 16th AIAA/CFD co...

متن کامل

Sparse distributed memory using N-of-M codes

An analysis is presented of a sparse distributed memory (SDM) inspired by that described by Kanerva [Kanerva, P. (1988). Sparse distributed memory. Cambridge, MA: MIT Press] but modified to facilitate an implementation based on spiking neurons. The memory presented here employs sparse binary N-of-M codes, unipolar binary synaptic weights and a simple Hebbian learning rule. It is a two-layer net...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001